3D Line Voxelization and Connectivity Control
نویسندگان
چکیده
A line voxelization algorithm generates from a 3D continuous line a 3D discrete line, which is a set of connected voxels approximating the continuous line. The connectivity of this set is a predeened attribute that speciies the way consecutive voxels are related along the line, and determines the nal shape and penetration property of the discrete line. In this paper these properties and the accuracy-speed tradeoo for various connectivity classes are investigated. A new algorithm, called the Tripod algorithm, which generates an exact 3D discrete line, is presented. For ray tracing/casting applications it can adaptively alternate between connectivities and it enjoys the advantages of the diierent connectivities with no cost penalty.
منابع مشابه
A Topological Approach to Voxelization
We present a novel approach to voxelization, based on intersecting the input primitives against intersection targets in the voxel grid. Instead of relying on geometric proximity measures, our approach is topological in nature, i.e., it builds on the connectivity and separability properties of the input and the intersection targets. We discuss voxelization of curves and surfaces in both 2D and 3...
متن کاملVoxelization of Free-Form Solids Represented by Catmull-Clark Subdivision Surfaces
A voxelization technique and its applications for objects with arbitrary topology are presented. It converts a free-form object from its continuous geometric representation into a set of voxels that best approximates the geometry of the object. Unlike traditional 3D scan-conversion based methods, our voxelization method is performed by recursively subdividing the 2D parameter space and sampling...
متن کاملVoxelization of Free-form Solids using Catmull-Clark Subdivision Surfaces
A voxelization technique and its applications for objects with arbitrary topology are presented. With parametrization techniques for subdivision surfaces becoming available, it is possible now to model and represent any continuous but topologically complex object with an analytical and mathematical representation. In this paper we propose a method to convert a free-form object from its continuo...
متن کاملVoxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing solutions are designed to obtain a voxelization of the solid. In this paper a new approach to rasterize and voxelize solids in 3D is presented. The described algorithms are very simple, general and robust. The 3D algorit...
متن کاملA Low Cost Antialiased Space Filled Voxelization Of Polygonal Objects
In a virtual sculpting environment, we manipulate objects as a set of volume elements (voxels). In order to start the sculpture process from a polygonal object, we have to discretize this object as a set of voxels. This step is called voxelization. Several voxelization methods have already been proposed, but none matches all of our criteria. In this paper, we propose a practical approach that h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Computer Graphics and Applications
دوره 17 شماره
صفحات -
تاریخ انتشار 1997